Rectangles Algorithm for Generating Normal Variates
نویسندگان
چکیده
We propose an algorithm for generating normal random variates that is based on the acceptance–rejection method and uses a piecewise majorizing function. The piecewise function has 2048 equal-area pieces, 2046 of which are constant, and the two extreme pieces are curves that majorize the tails. The proposed algorithm has not only good performance from correlation induction perspective, but also works well from a speed perspective. It is faster than the inversion method by Odeh and Evans and most other methods. © 2011 Wiley Periodicals, Inc. Naval Research Logistics 00: 000–000, 2011
منابع مشابه
The IUFP Algorithm for Generating Simulation Heart
In all systems simulation, random variates are considered as a main factor and based of simulation heart. Actually, randomization is inducted by random variates in the simulation. Due to the importance of such a problem, a new method for generation of random variates from continuous distributions is presented in this paper. The proposed algorithm, called uniform fractional part (UFP) is simpler...
متن کاملGenerating Antithetic Random Variates in Simulation of a Replacement Process by Rejection Method
When the times between renewals in a renewal process are not exponentially distributed, simulation can become a viable method of analysis. The renewal function is estimated through simulation for a renewal process simulation for a renewal process with gamma distributed renewal times and the shape parameter a > 1. Gamma random deviates will be generated by means of the so called Acceptance Rejec...
متن کاملAlgorithm 488: a Gaussian Pseudo-random Number Generator [g5]
We present an algorithm GRAND for generating normally distributed pseudo-random numbers, assuming the existence of a source of uniform random numbers. The method is exact, apart from the effect of rounding errors. The idea of using a rejection technique to avoid any elementary function evaluations is due to Von Neumann [4] and Forsythe [3], but our implementation requires less uniform samples p...
متن کاملGenerating random variates for stable sub-Gaussian processes with memory
We present a computationally efficient method to generate random variables from a univariate conditional probability density function (PDF) derived from a multivariate α-sub-Gaussian (αSG) distribution. The approach may be used to sequentially generate variates for sliding-window models that constrain immediately adjacent samples to be αSG random vectors. We initially derive and establish vario...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کامل